Topological pressure and dimension estimation
نویسندگان
چکیده
منابع مشابه
Estimation of Topological Dimension
We present two extensions of the algorithm by Broomhead et al [2] which is based on the idea that singular values that scale linearly with the radius of the data ball can be exploited to develop algorithms for computing topological dimension and for detecting whether data models based on manifolds are appropriate. We present a geometric scaling property and dimensionality criterion that permit ...
متن کاملCoding sequence density estimation via topological pressure.
We give a new approach to coding sequence (CDS) density estimation in genomic analysis based on the topological pressure, which we develop from a well known concept in ergodic theory. Topological pressure measures the 'weighted information content' of a finite word, and incorporates 64 parameters which can be interpreted as a choice of weight for each nucleotide triplet. We train the parameters...
متن کاملTopological Games and Covering Dimension
We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces. All spaces in this paper are assumed to be separable metric spaces. Infinite games can be used in a natural way to define ordinal valued functions on the class of separable metric spaces. One of our examples of such an ordinal function coincides in any finit...
متن کاملTopological diagonalizations and Hausdorff dimension
The Hausdorff dimension of a product X × Y can be strictly greater than that of Y , even when the Hausdorff dimension of X is zero. But when X is countable, the Hausdorff dimensions of Y and X × Y are the same. Diagonalizations of covers define a natural hierarchy of properties which are weaker than “being countable” and stronger than “having Hausdorff dimension zero”. Fremlin asked whether it ...
متن کاملDimension-Extended Topological Relationships
analysis. In Proc. 21st Int. Conf. on Machine Learning, 2004. 5. Ding C., He X., Zha H., and Simon H. Unsupervised learning: self-aggregation in scaled principal component space. Principles of Data Mining and Knowledge Discovery, 6th European Conf., 2002, pp. 112–124. 6. Fiedler M. Algebraic connectivity of graphs. Czech. Math. J., 23:298–305, 1973. 7. Hagen M. and Kahng A.B. New spectral metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SCIENTIA SINICA Mathematica
سال: 2016
ISSN: 1674-7216
DOI: 10.1360/n012016-00133